INTEGERS WITH A DIVISOR IN (y, 2y]
نویسنده
چکیده
In this note we prove only the important special case (1.1), omitting the parts of the argument required for other cases. In addition, we present an alternate proof, dating from 2002, of the lower bound implicit in (1.1). This proof avoids the use of results about uniform order statistics required in [3], and instead utilizes the cycle lemma from combinatorics. Although shorter and technically simpler than the argument in [3], this method is not useful for counting integers with with a prescribed number of divisors in (y, 2y]. We mention here one of the applications of (1.1), a 50-year old problem of Erdős ([1], [2]) known colloquially as the “multiplication table problem”. Let A(x) be the number of positive integers n ≤ x which can be written as n = m1m2 with each mi ≤ √ x. Then
منابع مشابه
Integers with a Divisor In
In this note we prove only the important special case (1.1), omitting the parts of the argument required for other cases. In addition, we present an alternate proof, dating from 2002, of the lower bound implicit in (1.1). This proof avoids the use of results about uniform order statistics required in [3], and instead utilizes the cycle lemma from combinatorics. Although shorter and technically ...
متن کاملIntegers with a Large Smooth Divisor
We study the function Θ(x, y, z) that counts the number of positive integers n ≤ x which have a divisor d > z with the property that p ≤ y for every prime p dividing d. We also indicate some cryptographic applications of our results.
متن کاملA FIXED POINT APPROACH TO THE INTUITIONISTIC FUZZY STABILITY OF QUINTIC AND SEXTIC FUNCTIONAL EQUATIONS
The fixed point alternative methods are implemented to giveHyers-Ulam stability for the quintic functional equation $ f(x+3y)- 5f(x+2y) + 10 f(x+y)- 10f(x)+ 5f(x-y) - f(x-2y) = 120f(y)$ and thesextic functional equation $f(x+3y) - 6f(x+2y) + 15 f(x+y)- 20f(x)+15f(x-y) - 6f(x-2y)+f(x-3y) = 720f(y)$ in the setting ofintuitionistic fuzzy normed spaces (IFN-spaces). This methodintroduces a met...
متن کاملComplete Tripartite Graphs and their Competition Numbers
We present a piecewise formula for the competition numbers of the complete tripartite graphs. For positive integers x, y and z where 2 ≤ x ≤ y ≤ z, the competition number of the complete tripartite graph Kx,y,z is yz − z − y − x + 3 whenever x 6= y and yz − 2y − z + 4 otherwise.
متن کاملTriple Solutions for a Higher-order Difference Equation
In this paper, we are concerned with the following nth difference equations ∆y(k − 1) + f(k, y(k)) = 0, k ∈ {1, . . . , T}, ∆y(0) = 0, i = 0, 1, . . . , n− 2, ∆n−2y(T + 1) = α∆n−2y(ξ), where f is continuous, n ≥ 2, T ≥ 3 and ξ ∈ {2, . . . , T − 1} are three fixed positive integers, constant α > 0 such that αξ < T + 1. Under some suitable conditions, we obtain the existence result of at least th...
متن کامل